Parametrization and smooth approximation of surface triangulations

نویسنده

  • Michael S. Floater
چکیده

A method based on graph theory is investigated for creating global parametrizations for surface triangulations for the purpose of smooth surface fitting. The parametrizations, which are planar triangulations, are the solutions of linear systems based on convex combinations. A particular parametrization, called shape-preserving, is found to lead to visually smooth surface approximations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Error Estimates for the Numerical Approximation of Surface Integrals

Recently, the first author introduced a new approach to the numerical quadrature of surface integrals in the context of boundary element methods. It is assumed that a global parametrization m of the surface is only indirectly given (e.g., via an iterative method) and that m is not accessible analytically. Of particular interest are parametrizations which are based on automatic triangulations of...

متن کامل

Curvature line parametrization from circle patterns

We study local and global approximations of smooth nets of curvature lines and smooth conjugate nets by respective discrete nets (circular nets and planar quadrilateral nets) with edges of order ǫ. It is shown that choosing the points of discrete nets on the smooth surface one can obtain the order ǫ 2 approximation globally. Also a simple geometric construction for approximate determination of ...

متن کامل

Delaunay Edge Flips in Dense Surface Triangulations

Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of triangulations which are not full dimensional is surface triangulations in three dimensions. In this paper we address the question of converting a surface t...

متن کامل

Smooth Parametrizations in Dynamics, Analysis, Diophantine and Computational Geometry

Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the present paper is to provide a short overview of some results and open problems on smooth parametrization and its applications in several apparently rather separ...

متن کامل

Geometric Accuracy Analysis for Discrete Surface Approximation

In geometric modeling and processing, computer graphics, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the surface. A fundamental problem is to design rigorous algorithms to guarantee the geometric approximation accuracy by controlling the sampling density. This theoretic work gives explicit formula to the bounds of Hausdorff distance, normal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1997